Regular graph
Generalized Krein Parameters of a Strongly Regular Graph
... ular graph, in Section 3, we define the generalized Krein parameters of a strongly regular ...strongly regular graph that give different in- formation from that given by the Krein conditions ...
10
Binomial Hadamard Series and Inequalities over the Spectra of a Strongly Regular Graph
... strongly regular graph G is called primitive if G and G are ...strongly regular graph that is not primitive is called an imprimitive strongly reg- ular ...strongly regular graph ...
17
A Study on Magic Labeling Regular Graph
... Proof : By induction on r. We show a stronger result. Not only we give an (s, 1) -VAT labeling of G, but the vertex labels will be consecutive integers. Moreover, we can specify which weight s + (i − 1) will be assigned ...
6
(Re)introducing Regular Graph Languages
... probabilistic regular lan- guages, which characterise many mod- els in natural language ...bilistic regular languages for graphs. This paper presents regular graph languages, a formalism due ...
14
The matching polynomial of a distance regular graph
... highly regular combinatorial struc- tures that often occur in connection with other areas of combinatorics ...the graph, and their multiplicities, and hence, we can determine the characteristic polynomial ...
9
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {25; 16; 1; 1; 8; 25}
... We found possible automorphisms of a distance regular graph with intersection array {25, 16, 1; 1, 8, 25}. This completes the research program of vertex-symmetric antipodal distance-regular graphs of ...
6
AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}
... distance-regular graph Γ with inter- section array {39, 36, 4; 1, 1, ...A graph with intersection array {39, 36, 4; 1, 1, 36} has v = 1 + 39 + 1404 + 156 = 1600 vertices and the spectrum 39 1 , 7 675 ...
10
Vol 9, No 4 (2018)
... - regular on (n+1) x 2 r- n ...- regular graph on 3 x 2 r-2 vertices ...- regular graph on 4 x 2 r-3 ...(r-1)-regular graph on 5 x 2 r-4 vertices ...
8
On r Edge Connected r Regular Bricks and Braces and Inscribability
... r-regular graph where r ≥ 3 is odd is necessarily ...matching-covered graph, a procedure described in a landmark paper by Lov´ asz [11] in the study of the matching ...
9
Vertex Removable Cycles of Graphs and Digraphs
... r-regular graph G has an edge re- movable cycle if and only if it contains a Hamiltonian ...r-regular graph, where r is a positive integer even ...
9
Study of inverse sum indeg index
... a graph with maximum ISI index in MG ( 2, n ) , since a 4-regular graph has the maximum value of ISI among all connected graphs, similar to the proof of Theorem ...extremal graph in the class ...
7
Second Hamiltonian Cycles in Claw-Free Graphs
... Thomassen [10] showed Conjecture 1 holds for d > 72. This was later improved by Ghandehari and Hatami [5] who proved the conjecture for d > 48. The best known progress is due to Haxell, Seamone, and Verstraete [6], ...
5
New Results on Vertex Prime Graphs
... a graph with exactly 2 components, one of which is not an odd cycle has a vertex prime labeling and a 2 – regular graph with atleast two odd cycles does not have a vertex prime ...– regular ...
5
Growth of graph powers
... Theorem 2 leads to the question of how the growth behaves for other powers of the G. Note that Theorem 2 cannot be used recursively to obtain such a result – since the cube of a regular graph is not ...
7
Symmetric Laplacians, quantum density matrices and their Von Neumann entropy
... complete graph achieves maximum Von Neumann entropy, while the 2-regular graph is within log 4 √ 2/3 of the smallest Von Neumann entropic values among all connected ...star graph minimizes the ...
11
Vol 9, No 5 (2018)
... fuzzy graph was proposed by Kaufmann, from the fuzzy relations introduced by ...of graph theoretic concepts such as paths, cycles, connectedness and ...fuzzy graph - ...proposed regular ...
5
High-Throughput Finite Field Multipliers Using Redundant Basis for FPGA and ASIC Implementations
... The choice of basis to represent field elements, namely the polynomial basis, normal basis, triangular basis and redundant basis (RB) has a major impact on the performance of the arithmetic circuits. The multipliers ...
11
A classification of nilpotent $3$-BCI groups
... bi-Cayley graph BCay(G, T ), BCay(G, S) ∼ = BCay(G, T) implies that T = gS α for some g ∈ G and α ∈ Aut(G). A group G is called an m-BCI-group if all bi-Cayley graphs of G of valency at most m are BCI-graphs, and ...
14
Class Notes in Computer Science (First Edition)
... transition graph can be seen as a non-deterministic finite ...transition graph can be converted to a state ...transition graph into a state graph (version 2 ...
112
Regular number of line block graph of a graph
... is the minimum cardinality of total dominating set of . A set with minimum cardinality among all the maximal is called minimum independent . The cardinality of a minimum independent dominating set is called independent ...
6