Search
ChatPaper
AI Writing
analysis
Analysis
编组
Open Data
more
More
RankingsMust ReadingJournal&ConferenceAI TRAI HistoryMaster Reading TreeXiaomai's Star TalentsTrajectoryTalentNDI TrackerOpenAI sign Language
VIPCreated with Sketch.

The minimum matching energy of tricyclic graphs with given girth and without K4-sub division

Gang Ma,Shengjin Ji,Qiuju Bian,Xia Li

Ars Comb.（2017）

Cited 22|Views3
No score
Abstract
The matching energy of a graph was introduced by Gutman and Wagner in 2012 and defined as the sum of the absolute values of zeros of its matching polynomial. In this paper, we completely determine the graph with minimum matching energy in tricyclic graphs with given girth and without K4-subdivision.
More
Translated text
Key words
matching energy,graph energy,tricyclic graph,girth
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined